The Best Lower Bound for the Permanent of a Correlation Matrix of Rank Two

If 1≤k≤n, then Cor(n,k) denotes the set of all n×n real correlation matrices of rank not exceeding k. Grone and Pierce have shown that if A∈Cor (n, n-1), then per(A)≥n/(n-1). We show that if A∈Cor(n,2), then , and that this inequality is the best possible.     

The structure of students' emotions experienced during a mathematical achievement test

Several models have been developed in order to categorize the numerous expressions that people use in order to describe their emotional experiences. The focus of the present study is on one of these theoretical classifications proposed by Pekrun (1992) specifically concerning emotions which are directly related to learning and achievement in mathematics. In his model, emotions are classified according to their valence (positive vs. negative) and their level of activation. In testing the assumptions of this model, we investigated students' enjoyment, anxiety, anger and boredom experienced before, during, and after the completion of a math test. Correspondence analyses which were used to generate a graphical illustration of structural interrelationships between these emotions provide empirical support for the theoretical classification.     

Validation of a computer-program for the interpretation of infrared spectra

The capability of a modern interpretation system for IR spectra has been tested, in which the process of structural assignment is modelled by methods of fuzzy logic. Figures of merit were generated for different interpretation algorithms. These figures of merit permit the validation as well as a comparison of independent interpretation systems. The influence of the sample preparation practice onto the information content of the resulting spectrum has been evaluated as well. Automatically generated band tables show only restricted reliability. Received: 13 February 1997 / Revised: 1 April 1997 / Accepted: 3 April 1997     

Regularity of multiwavelets

The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L _p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.     

Large N phase transition in the heat kernel on the U (N) group

The large N phase transition point is investigated in the heat kernel on the U(N) group with respect to arbitrary boundary conditions. A simple functional relation is found relating the density of eigenvalues of the boundary field to the saddle point shape of the typical Young tableaux in the large N limit of the character expansion of the heat kernel. Both strong coupling and weak coupling phases are investigated for some particular cases of the boundary holonomy.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Ray-Singer type theorem for the refined analytic torsion

We show that the refined analytic torsion is a holomorphic section of the determinant line bundle over the space of complex representations of the fundamental group of a closed oriented odd-dimensional manifold. Further, we calculate the ratio of the refined analytic torsion and the Farber-Turaev combinatorial torsion. As an application, we establish a formula relating the eta-invariant and the phase of the Farber-Turaev torsion, which extends a theorem of Farber and earlier results of ours. This formula allows to study the spectral flow using methods of combinatorial topology.